Strategies for Distributed Constraint Satisfaction Problems
نویسنده
چکیده
Constraint satisfaction problems are important in AI. Various distributed and parallel computing strategies have been proposed to solve these problems. In this paper, these strategies are classified as distributed-agent-based, parallel-agent-based, and function-agent-based distributed problem-solving strategies. These different strategies are presented and discussed. Parallel-agentbased strategies are found to be very versatile. Computational experience is presented.
منابع مشابه
Heuristic Search For Distributed Constraint Satisfaction Problems
A large number of problems in AI and other areas of computer science can be viewed as special cases of the constraint satisfaction problem (CSP). Various distributed and parallel computing approaches have been used to solve these problems. Mainly, these approaches can be classiied as variable-based, domain-based, and function-based distributed problem solving strategies. In this paper, some heu...
متن کاملDistributed Guided Local Search for Solving Binary DisCSPs
We introduce the Distributed Guided Local Search (DistGLS) algorithm for solving Distributed Constraint Satisfaction Problems. Our algorithm is based on the centralised Guided Local Search algorithm, which is extended with additional heuristics in order to enhance its efficiency in distributed scenarios. We discuss the strategies we use for dealing with local optima in the search for solutions ...
متن کاملNogood-FC for solving partitionable constraint satisfaction problems
Many real problems can be naturally modelled as constraint satisfaction problems (CSPs). However, some of these problems are of a distributed nature, which requires problems of this kind to be modelled as distributed constraint satisfaction problems (DCSPs). In this work, we present a distributed model for solving CSPs. Our technique carries out a partition over the constraint network using a g...
متن کاملDistributed Configuration as Distributed Dynamic Constraint Satisfaction
Dynamic constraint satisfaction problem (DCSP) solving is one of the most important methods for solving various kinds of synthesis tasks, such as configuration. Todays configurators are standalone systems not supporting distributed configuration problem solving functionality. However, supply chain integration of configurable products requires the integration of configuration systems of differen...
متن کاملStochastic Local Search for Distributed Constraint Satisfaction Problems
Nowadays, many real problems can be solved using local search strategies. These algorithms incrementally alter inconsistency value assignments to all the variables using a repair or hill climbing metaphor to move towards more and more complete solutions. Furthermore, if the problem can be modeled as a distributed problem, the advantages can be even greater. This paper presents a distributed mod...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994